TSTP Solution File: SET615^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET615^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:19:36 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 83 ( 5 equ; 0 cnn)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 197 ( 37 ~; 50 |; 16 &; 93 @)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 19 ( 12 ^ 7 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_27,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_36,type,
epred1_0: $i > $o ).
thf(decl_37,type,
epred2_0: $i > $o ).
thf(decl_38,type,
epred3_0: $i > $o ).
thf(decl_39,type,
esk1_0: $i ).
thf(union,axiom,
( union
= ( ^ [X5: $i > $o,X6: $i > $o,X4: $i] :
( ( X5 @ X4 )
| ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7Tth66s01B/E---3.1_21621.p',union) ).
thf(setminus,axiom,
( setminus
= ( ^ [X11: $i > $o,X12: $i > $o,X4: $i] :
( ( X11 @ X4 )
& ~ ( X12 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7Tth66s01B/E---3.1_21621.p',setminus) ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( setminus @ ( union @ X22 @ X23 ) @ X24 )
= ( union @ ( setminus @ X22 @ X24 ) @ ( setminus @ X23 @ X24 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7Tth66s01B/E---3.1_21621.p',thm) ).
thf(c_0_3,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_4,plain,
( setminus
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[setminus]) ).
thf(c_0_5,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X24: $i > $o,X28: $i] :
( ( ( ( X22 @ X28 )
| ( X23 @ X28 ) )
& ~ ( X24 @ X28 ) )
<=> ( ( ( X22 @ X28 )
& ~ ( X24 @ X28 ) )
| ( ( X23 @ X28 )
& ~ ( X24 @ X28 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_3]),c_0_4])]) ).
thf(c_0_6,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) )
& ( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
thf(c_0_7,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
( ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 )
| ~ ( epred3_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( epred3_0 @ esk1_0 ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
( ( epred3_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_12]) ).
thf(c_0_16,negated_conjecture,
epred2_0 @ esk1_0,
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SET615^3 : TPTP v8.1.2. Released v3.6.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n020.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 10:18:16 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.7Tth66s01B/E---3.1_21621.p
% 0.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44 # Starting sh1l with 300s (1) cores
% 0.16/0.44 # Starting post_as_ho10 with 300s (1) cores
% 0.16/0.44 # post_as_ho1 with pid 21700 completed with status 0
% 0.16/0.44 # Result found by post_as_ho1
% 0.16/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # new_ho_10 with pid 21704 completed with status 0
% 0.16/0.44 # Result found by new_ho_10
% 0.16/0.44 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.44 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.44 # No SInE strategy applied
% 0.16/0.44 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 29
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 26
% 0.16/0.44 # Removed in clause preprocessing : 14
% 0.16/0.44 # Initial clauses in saturation : 12
% 0.16/0.44 # Processed clauses : 5
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 4
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 1
% 0.16/0.44 # ...of the previous two non-redundant : 1
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 0
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 1
% 0.16/0.44 # ...of those cached : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 3
% 0.16/0.44 # Positive orientable unit clauses : 1
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 2
% 0.16/0.44 # Non-unit-clauses : 0
% 0.16/0.44 # Current number of unprocessed clauses: 8
% 0.16/0.44 # ...number of literals in the above : 22
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 1
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 0
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 5
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 1349
% 0.16/0.44 # Search garbage collected termcells : 243
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.004 s
% 0.16/0.44 # System time : 0.000 s
% 0.16/0.44 # Total time : 0.004 s
% 0.16/0.44 # Maximum resident set size: 1748 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.007 s
% 0.16/0.44 # System time : 0.000 s
% 0.16/0.44 # Total time : 0.007 s
% 0.16/0.44 # Maximum resident set size: 1744 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------